The Soft Cumulative Constraint
نویسندگان
چکیده
This research report presents an extension of Cumulative of Choco constraint solver, which is useful to encode over-constrained cumulative problems. This new global constraint uses sweep and task interval violation-based algorithms.
منابع مشابه
ar X iv : 0 90 7 . 09 39 v 1 [ cs . A I ] 6 J ul 2 00 9 The Soft Cumulative Constraint
This research report presents an extension of Cumulative of Choco constraint solver, which is useful to encode over-constrained cumulative problems. This new global constraint uses sweep and task interval violation-based algorithms.
متن کاملar X iv : 0 90 7 . 09 39 v 2 [ cs . A I ] 7 J ul 2 00 9 The Soft Cumulative Constraint Thierry Petit Emmanuel
This research report presents an extension of Cumulative of Choco constraint solver, which is useful to encode over-constrained cumulative problems. This new global constraint uses sweep and task interval violation-based algorithms.
متن کاملSoft Scheduling
Classical notions of disjunctive and cumulative scheduling are studied from the point of view of soft constraint satisfaction. Soft disjunctive scheduling is introduced as an instance of soft CSP and preferences included in this problem are applied to generate a lower bound based on existing discrete capacity resource. Timetabling problems at Purdue University and Faculty of Informatics at Masa...
متن کاملExperimental Evidence for Constraint Competition in Gapping Constructions
This paper presents the results of two experiments investigating gradient acceptability in gapping constructions. Experiment 1 shows that adjuncts and complements are equally acceptable as remnants in gapping, a fact that has been surrounded by controversy in the literature. It also provides evidence against the claim that gapping must leave behind exactly two remnants, and shows that subject r...
متن کاملHybrid tractability of soft constraint problems
The constraint satisfaction problem (CSP) is a central generic problem in computer science and artificial intelligence: it provides a common framework for many theoretical problems as well as for many real-life applications. Soft constraint problems are a generalisation of the CSP which allow the user to model optimisation problems. Considerable effort has been made in identifying properties wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0907.0939 شماره
صفحات -
تاریخ انتشار 2009